搜索资源列表
Binary-tree-traversal-algorithm
- 数据结构中，实现二叉树的遍历，包含前序，中序和后序-Data structure, binary tree traversal, including former preorder, inorder and postorder
binary-tree
- 二叉树的基本算法代码，包括插入节点、删除节点、遍历二叉树等基本算法。-Binary basic algorithm code, including insert nodes, delete nodes, and other basic binary tree traversal algorithm.
binary-tree-amplitude
- 这是我参加某公司面试时做的一个二叉树问题题目，题目是求任意给出一组数看是否在树上，并求节点和数的裕度。这是我的答案，给大家分析参考。-This is a binary tree question when I participate a company s interview. The question is judging if a random series number is in binary tree and get the node and tree s amplitude.It s
binary-tree
- 用二叉链表存储二叉树，用“扩张先序遍历序列”创建二叉链表，对二叉树进行前、中、后序的遍历以及层次遍历，输出度为0、1、2的节点及节点数，线索化二叉树，根据线索化的二叉树查找二叉树中任意节点的前驱、后继，通过线索二叉树进行二叉树节点的删除、插入，以及按树状打印二叉树。-Used to store binary tree binary tree, use the " expansion preorder sequence" to create the binary tree, th
Binary-tree-list
- 二叉树列表,满足先序遍历递归和非递归，可自由创建-Binary tree list
Highly-balanced-binary-tree
- 平衡二叉树它是一 棵空树或它的左右两个子树的高度差的绝对值不超过1，并且左右两个子树都是一棵平衡二叉树。-The absolute value of difference in height which is balanced binary tree or a tree left empty subtrees not more than 1, and the left and right sub-trees are balanced binary tree.
Binary-tree-traversal
- 二叉树遍历，有先序遍历，中序遍历，后序遍历等遍历方法的java实现-Binary tree traversal, there are preorder, java preorder, postorder traversal methods, such as the realization of
Binary-tree-shortest-path-summation
- 这是一个数据结构中二叉树的最短路径求解的问题的源代码打包，代码简明易懂，方便初学者的学习-This is a binary tree data structure for solving the shortest path problem' s source code package, code easy to understand, easy for beginners to learn
A-Binary-Tree-for-Probability-Learning-in-Eye-Det
- A Binary Tree for Probability Learning in Eye Detection
Binary-Tree
- 生成二叉树，前序、中序、后序遍历二叉树。可以使用菜单选择。-Generate binary tree, preorder, inorder, postorder tree traversal. You can use the Select menu.
binary-tree
- 在VC 6.0环境中用C++语言实现对数据结构中二叉树算法进行描述，共包括五个例程-VC 6.0 environment using C++ language of binary tree data structure algorithms described, including a total of five routines
Balanced-Binary-Tree
- 基本实现平衡二叉树的创建，插入和删除操作。使用C++代码实现-Basic balanced binary tree to create and delete operation.
Binary-Tree
- Binary Tree Class source code
binary-tree-program
- 二叉树是常用的数据结构，本程序式基于二叉树的数据结构C++程序-binary tree program
binary-tree-traversal-traversal--
- 能够对二叉树进行先序、中序和后序遍历，并能在极限值下运行-Can two binary tree preorder, inorder and postorder traversal, and can run in the ultimate value.
binary-tree
- 由中根序列和后根序列重建二叉树，然后以前根顺序输出。-Central root sequence and the sequence of reconstruction after the binary tree root
Chain-binary-tree
- 用VC6.0编写的关于数据结构的链式二叉树算法和代码-About chain binary tree data structure algorithms and code VC6.0 prepared
binary-tree-traversal
- 程序包括二叉树的前序，中序，后序遍历以及特定数据的查找-Program includes former preorder, preorder, after preorder of binary tree traversal and finding specific data. For simple binary tree software curriculum.
the-two-binary-tree-coding
- 使用以下方案为二叉树编码： 空树编码为0 单结点树编码为1 所有m个结点的二叉树编码小于（m+1）个结点的二叉树的编号 若任何m个结点的二叉树，当左右子树为L和R个时的二叉树编号为n，则下列情况下所有m个结点的二叉树，其编号大于n： 左子树的编号大于L 左子树的编号为L，右子树的编号大于R 要求给定一个序数，输出一棵二叉树 -Use the following scheme is binary coded: empty tree coded 0 for singl
the-minimum-cost-of-a-binary-tree
- 在二分检索树中，为了把动态规划应用于得到一颗最优二分检索树的问题，需要把构造这样的一个数看成是一系列决策的结果，而且要能列出求取最优决策序列的递推式，可以帮助你了解最优成本二叉树的实现-In a binary search tree, dynamic programming is applied in order to get the best question a binary search tree, we need to construct a number such as a resul